Sharp maximal Lp-bounds for continuous martingales and their differential subordinates

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Maximal Inequalities for Conditionally Symmetric Martingales and Brownian Motion

Let B = {Bt)t>0 be a standard Brownian motion. For c > 0, k > 0 , let T(c, k) = inî{t > 0: maxs<í Bs cBt > k} , T"(c,k)= inf{r>0: max^, \BS\ c\B,\ > k} . We show that for c > 0 and k > 0, both T(c, k) and T*{c, k) axe finite almost everywhere. Moreover, T(c, k) and T*(c, k) e L if and only if c < pKp 1) for p > 1 , and for all c > 0 when p < 1 . These results have analogues for simple random wa...

متن کامل

Lp BOUNDS FOR SINGULAR INTEGRALS AND MAXIMAL SINGULAR

Convolution type Calderr on-Zygmund singular integral operators with rough kernels p.v. (x)=jxj n are studied. A condition on implying that the corresponding singular integrals and maximal singular integrals map L p ! L p for 1 < p < 1 is obtained. This condition is shown to be diierent from the condition 2 H 1 (S n?1).

متن کامل

Continuous Martingales and Local Martingales

Throughout these notes, (Ω,F ,P ) will be a probability space and F := {Ft }t∈J a filtration indexed by J , where J is an interval, usually J = [0,∞). The filtration F is said to be complete if each Ft contains all sets of measure 0, and is right-continuous if Ft =∩s>t Fs . A standard filtration is a filtration that is both complete and right-continuous. A stochastic process {X t }t≥0 defined o...

متن کامل

Polar martingales of maximal spread

This paper investigates polar codes for q-ary input channels using other kernels than [ 1 0 1 1 ] to construct the generator matrix. The kernel is optimized by maximizing the spread of the polar martingale and it is shown that in certain cases, the resulting construction has a significantly improved error probability (even at small block length like n = 1024).

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2021

ISSN: 1083-6489

DOI: 10.1214/21-ejp596